A Kronecker Compiler for Fast Transform Algorithms
نویسنده
چکیده
We present a source-to-source compiler that processes matrix formulae in the form of Kronecker product factorizations. The Kronecker product notation allows for simple expressions of algorithms such as Walsh-Hadamard, Haar, Slant, Hartley, and FFTs as well as transpositions and wavelet transforms. The compiler is based on a set of term rewriting rules that translate high level matrix descriptions into parallel and sequential loops and assignment statements. We provide back-end translators for FORTRAN, FORTRAN-90, C and Matlab .
منابع مشابه
SYNTHESIZING EFFICIENTOUT-OF-CORE PROGRAMS FOR BLOCK RECURSIVE ALGORITHMS USING BLOCK-CYCLIC DATA DISTRIBUTIONSy
This paper presents a framework for synthesizing I/O-efficient out-of-core programs for block recursive algorithms , such as the fast Fourier transform and matrix transpositions. The programs are synthesized from tensor (Kronecker) product representations of algorithms. These programs are optimized for a striped two-level memory model where in the out-of-core data can have block-cyclic distribu...
متن کاملAlgebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for Real DFTs
In this paper we systematically derive a large class of fast general-radix algorithms for various types of real discrete Fourier transforms (real DFTs) including the discrete Hartley transform (DHT) based on the algebraic signal processing theory. This means that instead of manipulating the transform definition, we derive algorithms by manipulating the polynomial algebras underlying the transfo...
متن کاملA Rewriting System for the Vectorization of Signal Transforms
We present a rewriting system that automatically vectorizes signal transform algorithms at a high level of abstraction. The input to the system is a transform algorithm given as a formula in the well-known Kronecker product formalism. The output is a “vectorized” formula, which means it consists exclusively of constructs that can be directly mapped into short vector code. This approach obviates...
متن کاملFast computing of the positive polarity Reed - Muller transform over GF ( 2 ) and GF ( 3 )
The problem of efficient computing of binary and ternary positive (or zero) polarity Reed-Muller (PPRM) transform is important for many areas. The matrices, determining these transforms, are defined recursively or by Kronecker product. Using this fact, we apply the dynamic-programming strategy to develop three algorithms. The first of them is a new version of a previous our algorithm for perfor...
متن کاملContemporary View of Fft Algorithms
A large number of fast Fourier transform (FFT) algorithms exist for efficient computation of the discrete Fourier transform (DFT). In most previous benchmarking efforts, only the computation speed or the operations count have been used for assessing the efficiency of these algorithms. In this paper we provide a comprehensive comparison of several contemporary FFT algorithms on state-of-the-art ...
متن کامل